منابع مشابه
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. D...
متن کاملView-Dependent Hierarchical Foliage Simplification
High compression of plant geometry is an important aspect in fast realistic visualization of plants. Hierarchical structuring plant morphology is a key factor for real time plant rendering, especially when pedestrian views, including both close-ups and far views, are requested. We present here a new geometric simplification method, called Viewdependent Hierarchical Foliage Simplification (VHFS)...
متن کاملExternal Memory View-Dependent Simplification
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the re...
متن کاملHardware-Assisted View-Dependent Planar Map Simplification
In this paper, we present an algorithm and a system to perform dynamic view dependent simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-intersecting chains and a tolerance parameter for each chain, we produce a simplified map that resembles the original map, satisfying the condition that the distance between each point on the ...
متن کاملOn Exact Error Bounds for View-Dependent Simplification
In this article we present an analytical closed-form expression to ensure exact error bounds for view-dependent simplification which is of importance for several algorithms. The present work contains proofs and solutions for the general 2D case and particular 3D cases. Most preceeding works rely on coarse heuristics, that might fail and/or restrict movements or object representations. We introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 1999
ISSN: 0167-7055
DOI: 10.1111/1467-8659.00330